A simple polygon-polygon basis method to compare categorical raster maps

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Comparative Analysis of Polygon to Raster Interpolation Methods

Increasingly, data collected by irregular polygonal geographic regions are being converted to a grid-cell or pixel-based format for use as additional data layers within a Geographic Information System. This study used hypothetical data to examine the error involved in the coneersion of polygonal data to a pixel-based format. Error was found to be related to the complexity of the underlying surf...

متن کامل

Polygon and Polyline Join Using Raster Filters

Processing spatial joins efficiently is crucial to rendering the spatial data analysis process feasible. As pointed out in many works, the exact intersection test of two spatial objects is the most time-consuming and I/Oconsuming step in processing spatial joins. The use of approximations can reduce the need for examining the exact geometry of spatial objects in order to find the intersecting o...

متن کامل

Computing Polygon Similarity From Raster Signatures

One key issue in Peer Data Management Systems (PDMSs) is the heterogeneity of the peer schemas. To help matters, ontologies may be used as uniform conceptual representation of these schemas. In this work, we are working with geographic databases to be used in a PDMS. When dealing with geospatial data, specific problems with representation and usage occur. In this sense, we have developed an app...

متن کامل

A Simple Polygon Triangulation Algorithm

In this Paper we propose an easily implementable polygon triangulation algorithm using Shortest Paths. The algorithm runs in O(nlogk) deterministic time with k < n 3 . Our algorithm runs in linear time for a large class of polygons. The biggest advantage of the algorithm is that it uses very simple data structures and it computes the triangulation just by scanning the boundary of the polygon. W...

متن کامل

A simple kinetic visibility polygon

! " # %$& (') * + , -. ('0/ '1 2 3 %$4 52 /6 3 % & 4 7 89 & : ;< %$& = : > >;2'1 ; ? @ A CB*'1 = = : ;D E< -+'1 4 GFIH J K & = :5L /< = %$9 = 3 %$ M = 4 ON ,P 052 = ') ; M!'1 ; ? 0 Q ? = ? ! F Categories and Subject Descriptors R S TLS TJU V WYX1Z&[K\9Z0]_^_Z)`#acbed f4d g%Z)hji kmlmn0oKp*q1rOs*r(tKuvl p*w tKx=s*y=z4{3r oKn0|9}~x=t &p*€ {‚ t {3ƒ4p*€ „1s*yGqL…‡† 0M: &ˆ 3 / : = ‰ ? / %$ J 05

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal for Simulation and Multidisciplinary Design Optimization

سال: 2009

ISSN: 1779-627X,1779-6288

DOI: 10.1051/ijsmdo/2009009